A Differential Delay Equation Arising from the Sieve of Eratosthenes
نویسندگان
چکیده
The differential delay equation defined by to(u) = l/u for 1 < u < 2 and (uw(u))' = oj(u 1) for u > 2 was introduced by Buchstab in connection with an asymptotic formula for the number of uncanceled terms in the sieve of Eratosthenes. Maier has recently used this result to show there is unexpected irregularity in the distribution of primes in short intervals. The function co(u) is studied in this paper using numerical and analytical techniques. The results are applied to give some numerical constants in Maier's theorem.
منابع مشابه
The Genuine Sieve of Eratosthenes
A much beloved and widely used example showing the elegance and simplicity of lazy functional programming represents itself as “The Sieve of Eratosthenes”. This paper shows that this example is not the sieve, and presents an implementation that actually is.
متن کاملAn analytic study on the Euler-Lagrange equation arising in calculus of variations
The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...
متن کاملPeriodic solutions of fourth-order delay differential equation
In this paper the periodic solutions of fourth order delay differential equation of the form $ddddot{x}(t)+adddot{x}(t)+f(ddot{x}(t-tau(t)))+g(dot{x}(t-tau(t)))+h({x}(t-tau(t)))=p(t)$ is investigated. Some new positive periodic criteria are given.
متن کاملParallel Algorithms for the Third Extension of the Sieve of Eratosthenes
A prime number sieve is an algorithm for finding all prime numbers in the range [2,n]. For large n, however, the actual run time of existing algorithms on a single processor computer is prohibitive. Fortunately, the classic Sieve of Eratosthenes and its extensions are suitable for massively parallel architectures or networks of workstations. Two mappings of the third extension sieve are present...
متن کاملCache optimized linear sieve
Sieving is essential in different number theoretical algorithms. Sieving with large primes violates locality of memory access, thus degrading performance. Our suggestion on how to tackle this problem is to use cyclic data structures in combination with in-place bucket-sort. We present our results on the implementation of the sieve of Eratosthenes, using these ideas, which show that this approac...
متن کامل